Forbidden Freeze-in
نویسندگان
چکیده
منابع مشابه
Forbidden Vertices
In this work, we introduce and study the forbidden-vertices problem. Given a polytope P and a subset X of its vertices, we study the complexity of linear optimization over the subset of vertices of P that are not contained in X . This problem is closely related to finding the k-best basic solutions to a linear problem. We show that the complexity of the problem changes significantly depending o...
متن کاملForbidden Patterns
We consider the problem of indexing a collection of documents (a.k.a. strings) of total length n such that the following kind of queries are supported: given two patterns P and P−, list all nmatch documents containing P but not P−. This is a natural extension of the classic problem of document listing as considered by Muthukrishnan [SODA’02], where only the positive pattern P is given. Our main...
متن کاملForbidden Magnification ?
The twin of this paper, “Forbidden Magnification? I.” [1], presents systematic SOM simulations with the explicit magnification control scheme of Bauer, Der, and Herrmann [2] on data for which the theory does not guarantee success, namely data that are n-D, n > 2 and/or data whose components in the different dimensions are not statistically independent. For the unsupported n = 2 cases that we in...
متن کاملForbidden Words in Symbolic Dynamics
We introduce an equivalence relation between functions from to . By describing a symbolic dynamical system in terms of forbidden words, we prove that the -equivalence class of the function that counts the minimal forbidden words of a system is a topological invariant of the system. We show that the new invariant is independent from previous ones, but it is not characteristic. In the case of sof...
متن کاملForbidden subgraphs in connected graphs
Given a set ξ = {H1,H2, · · ·} of connected non acyclic graphs, a ξ-free graph is one which does not contain any member of ξ as copy. Define the excess of a graph as the difference between its number of edges and its number of vertices. Let Ŵk,ξ be theexponential generating function (EGF for brief) of connected ξ-free graphs of excess equal to k (k ≥ 1). For each fixed ξ, a fundamental differen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Physica Polonica B Proceedings Supplement
سال: 2020
ISSN: 1899-2358,2082-7865
DOI: 10.5506/aphyspolbsupp.13.733